Semi-Direct Product in Groups and Zig-Zag Product in Graphs: Connections and Applications

نویسندگان

  • Noga Alon
  • Alexander Lubotzky
  • Avi Wigderson
چکیده

We consider the standard semi-direct product AoB of finite groups A,B. We show that with certain choices of generators for these three groups, the Cayley graph of A o B is (essentially) the zigzag product of the Cayley graphs of A and B. Thus, using the results of [RVW00], the new Cayley graph is an expander if and only if its two components are. We develop some general ways of using this construction to obtain large constant-degree expanding Cayley graphs from small ones. In [LW93], Lubotzky and Weiss asked whether expansion is a group property; namely, is being expander for (a Cayley graph of) a group G depend solely on G and not on the choice of generators. We use the above construction to answer the question in negative, by showing an infinite family of groupsAioBi which are expanders with one choice of (constant-size) set of generators and are not with another such choice. It is interesting to note that this problem is still open, though, for “natural” families of groups, like the symmetric groups Sn or the simple groups PSL(2, p). ∗Schools of Mathematics and Computer Science, Tel-Aviv University, Tel Aviv, E-mail: [email protected]. Partially supported by a US-Israel BSF grant, by the Israel Science Foundation and by the Hermann Minkowski Minerva Center for Geometry at Tel Aviv University. †Department of Mathematics, The Hebrew University, Jerusalem, E-mail: [email protected]. Partially supported by NSF and US-Israel BSF grants. ‡Institute for Advanced Study, Princeton and the Hebrew University, Jerusalem. E-mail: [email protected]. Partially supported by NSF grants CCR-9987007 and CCR-9987845

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Zig-zag and replacement product graphs and LDPC codes

It is known that the expansion property of a graph influences the performance of the corresponding code when decoded using iterative algorithms. Certain graph products may be used to obtain larger expander graphs from smaller ones. In particular, the zig-zag product and replacement product may be used to construct infinite families of constant degree expander graphs. This paper investigates the...

متن کامل

On the Zagreb and Eccentricity Coindices of Graph Products

The second Zagreb coindex is a well-known graph invariant defined as the total degree product of all non-adjacent vertex pairs in a graph. The second Zagreb eccentricity coindex is defined analogously to the second Zagreb coindex by replacing the vertex degrees with the vertex eccentricities. In this paper, we present exact expressions or sharp lower bounds for the second Zagreb eccentricity co...

متن کامل

On Construction of Almost-Ramanujan Graphs

Reingold et al. introduced the notion zig-zag product on two different graphs, and presented a fully explicit construction of dregular expanders with the second largest eigenvalue O(d−1/3). In the same paper, they ask whether or not the similar technique can be used to construct expanders with the second largest eigenvalue O(d−1/2). Such graphs are called Ramanujan graphs. Recently, zig-zag pro...

متن کامل

Entropy Waves, the Zig-Zag Graph Product, and New Constant-Degree Expanders and Extractors

The main contribution of this work is a new type of graph product, which we call the zig-zag product. Taking a product of a large graph with a small graph, the resulting graph inherits (roughly) its size from the large one, its degree from the small one, and its expansion properties from both! Iteration yields simple explicit constructions of constant-degree expanders of arbitrary size, startin...

متن کامل

Testing Conductance in General Graphs

In this paper, we study the problem of testing the conductance of a given graph in the general graph model. Given distance parameter ε and any constant σ > 0, there exists a tester whose running time isO( (1+σ)/2·logn·log ε ε·Φ2 ), where n is the number of vertices andm is the number of edges of the input graph. With probability at least 2/3, the tester accepts all graphs of conductance at leas...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2001